Recursive Dynamic Programming: Heuristic Rules, Bounding and State Space Reduction
نویسنده
چکیده
An alternative approach towards dynamic programming (DP) is presented: Recursions. A basic deterministic model and solution function are defined and the model is generalized to include stochastic processes, with the traditional stochastic DP model as a special case. Heuristic rules are included in the models simply as restrictions on decision spaces and a small slaughter pig marketing planning example illustrates the potential state space reductions induced by such rules.
منابع مشابه
Heuristic Rules , Bounding and State Space Reduction
An alternative approach towards dynamic programming (DP) is presented: Recursions. A basic deterministic model and solution function are defined and the model is generalized to include stochastic processes, with the traditional stochastic DP model as a special case. Heuristic rules are included in the models simply as restrictions on decision spaces and a small slaughter pig marketing planning ...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملNew scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...
متن کاملDual Variable Based Fathoming in Dynamic Programs used for Column Generation 1 Marco
In column generation schemes, particularly those proposed for set partitioning type problems, dynamic programming algorithms are applied to solve the respective pricing subproblem. In addition to traditional dominance criteria for state space reduction, we develop a simple generic lower bounding criterion based on the dual optimal solution of the restricted master problem.
متن کاملExtracting Dynamics Matrix of Alignment Process for a Gimbaled Inertial Navigation System Using Heuristic Dynamic Programming Method
In this paper, with the aim of estimating internal dynamics matrix of a gimbaled Inertial Navigation system (as a discrete Linear system), the discretetime Hamilton-Jacobi-Bellman (HJB) equation for optimal control has been extracted. Heuristic Dynamic Programming algorithm (HDP) for solving equation has been presented and then a neural network approximation for cost function and control input ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007